A Faster Parallel Algorithm for Matrix Multiplication on a Mesh Array
نویسندگان
چکیده
Matrix multiplication is a fundamental mathematical operation that has numerous applications across most scientific fields. Cannon’s distributed algorithm to multiply two n-by-n matrices on a two dimensional square mesh array with n cells takes exactly 3n−2 communication steps to complete. We show that it is possible to perform matrix multiplication in just 1.5n − 1 communication steps on a two dimensional square mesh array of the same size, thus halving the number of steps required.
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملA two-layered mesh array for matrix multiplication
A two-layered mesh array for matrix multiplication is presented. It computes the matrix product faster than the standard array.
متن کاملCombining Shortest Paths, Bottleneck Paths and Matrix Multiplication
We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of ...
متن کاملA Processor-Time-Minimal Systolic Array for Cubical Mesh Algorithms
Using a directed acyclic graph (dag) model of algorithms, the paper focuses on time-minimal multiprocessor schedules that use as few processors as possible. Such a processor-time-minimal scheduling of an algorithm’s dag first is illustrated using a triangular shaped 2D directed mesh (representing, for example, an algorithm for solving a triangular system of linear equations). Then, algorithms r...
متن کاملModelling, simulation and verification of massively parallel algorithms
A novel approach to modelling, simulation and verification of parallel algorithms and structures is presented based on Matlab and Simulink environments. The approach is especially applicable to the verification of parallel algorithms for array processors. In this paper we focus on systolic arrays. The advantage is that the approach utilises professional and generally available tools. The effici...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014